A Bound on the Shannon Capacity via a Linear Programming Variation

On the Shannon capacity of a graph

A/Mmcr-It is proved that the Shannon zero-error capacity of the pentagon is e. The method is then generalized to obtain upper bounds on the capacity of au arbitrary graph. A well-characterized, and in a sense easily computable, function is introduced which bounds the capacity from above and equals the capacity in a large number of cases. Several results are obtained on the capacity of special g...

Improved Lower Bound on Shannon Capacity of C7

An independent set with vertices in the strong product of four cycles C C C C is given This improves the best known lower bound for the Shannon capacity of the graph C which is the zero error capacity of the corresponding noisy channel The search was done by a computer program using the simulated annealing algorithm with a constant time temperature schedule

The Linear-Programming Bound

on the effect of linear & non-linear texts on students comprehension and recalling

چکیده ندارد.

Achieving Shannon Capacity in a Wiretap Channel via Previous Messages

In this paper we consider a wiretap channel with a secret key buffer. We use the coding scheme of [1] to enhance the secrecy rate to the capacity of the main channel, while storing each securely transmitted message in the secret key buffer. We use the oldest secret bits from the buffer to be used as a secret key to transmit a message in a slot and then remove those bits. With this scheme we are...